Recognizing 3-collapsing words over a binary alphabet
نویسندگان
چکیده
منابع مشابه
Study of an Extension of Sturmian Words over a Binary Alphabet
In this paper, we define (k, l)-Sturmian words. Then, we study their complexity. Finally, we establish a characterization of these words via the action of particular morphisms on Sturmian words. Mathematics Subject Classification: 68R15
متن کاملA characterization of fine words over a finite alphabet
To any infinite word t over a finite alphabet A we can associate two infinite words min(t) and max(t) such that any prefix of min(t) (resp. max(t)) is the lexicographically smallest (resp. greatest) amongst the factors of t of the same length. We say that an infinite word t over A is fine if there exists an infinite word s such that, for any lexicographic order, min(t) = as where a = min(A). In...
متن کاملOn the Enumeration of Restricted Words over a Finite Alphabet
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which relies on the invert transform and its representation in terms of partial Bell polynomials, allows us to generalize and address in a systematic manner previo...
متن کاملComposing short 3-compressing words on a 2 letter alphabet
A finite deterministic (semi)automaton A = (Q,Σ, δ) is kcompressible if there is some word w ∈ Σ such that the image of the state set Q under the natural action of w is reduced by at least k states. Such word, if it exists, is called a k-compressing word for A. A word is k-collapsing if it is k-compressing for each k-compressible automaton. We compute a set Γ of short words such that all 3-comp...
متن کاملWords over an ordered alphabet and suffix permutations
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w, we present in this article a linear time and space method to determine whether a word w′ has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smalle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.045